#include<bits/stdc++.h>
#define ll long long
#define L x<<1
#define R x<<1|1
#define mid (l+r>>1)
#define lc L,l,mid
#define rc R,mid+1,r
#define OK Ll<=l&&r<=Rr
#define Root 1,1,tp
#define rep(x,y,z) for(int x=(y);x<=(z);x++)
#define per(x,y,z) for(int x=(y);x>=(z);x--)
#define repn(x) rep(x,1,n)
#define repm(x) rep(x,1,m)
#define pb push_back
#define e(x) for(int i=h[x],y=to[i];i;i=nxt[i],y=to[i])
#define E(x) for(auto y:p[x])
#define Pi pair<int,int>
#define ui unsigned ll
inline int read(){int s=0,w=1;char c=getchar();while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}while(c>=48&&c<=57)s=(s<<1)+(s<<3)+c-48,c=getchar();return s*w;}
inline void pf(int x){if(x<0) putchar('-'),x=-x;if(x>9)pf(x/10);putchar(x%10+48);}
using namespace std;
const int N=1e6+10,M=7e6+5,inf=(1LL<<31)-1,mod=998244353;
const ll llf=1e18;
inline void add(int &a,int b){((a+=b)>=mod) and (a-=mod);}
inline int Add(int a,int b){return add(a,b),a;}
inline int mul(int a,int b){return 1LL*a*b%mod;}
inline void Mul(int &a,int b){a=mul(a,b);}
inline void red(int &a,int b){add(a,mod-b);}
inline int Red(int a,int b){return red(a,b),a;}
inline int qp(int a,int b){if(!b)return 1;int c=qp(a,b>>1);Mul(c,c);if(b&1)Mul(c,a);return c;}
inline int INV(int x){return qp(x,mod-2);}
int n,a[N],ans;
ll sum;
int b[N],c[N];
const ui base=1333331;
map<ui,int>P;
inline void dfs(int pos){
	if(pos==n+1){
		repn(i)b[i]=0;
		repn(i)b[i]+=a[i]-c[i],b[i%n+1]+=c[i];
		ui H=0;
		repn(i)H=H*base+b[i];
		if(P[H])return;
		P[H]=1;
		int sum=b[1];
		rep(i,2,n)Mul(sum,b[i]);
		add(ans,sum);
		return;
	}
	rep(i,0,a[pos])c[pos]=i,dfs(pos+1);
}
inline void subtask1(){
	dfs(1);
	cout <<ans;
}
inline void Main(){
    n=read();
	bool fl=1;
	repn(i)a[i]=read(),fl&=a[i]<=1,sum+=a[i];
	if(fl)return puts(sum==n?"1":"0"),void();
	return subtask1(),void();
}
signed main(){
	freopen("trade.in","r",stdin);
	freopen("trade.out","w",stdout);
	int T=1;
	while(T--)Main();
	return 0;
}